The computation of Gröbner bases on a shared memory multiprocessor
نویسنده
چکیده
The principal result described in this report is the design and implementation of a parallel version of Buchberger's algorithm. Its correctness is stated and some experimental results are given. The first parts are devoted to a partial review of Grobner bases, of Buchberger's algorithm which computes them, and of some of their applications.
منابع مشابه
Parallel and distributed Gröbner bases computation in JAS
This paper considers parallel Gröbner bases al-gorithms on distributed memory parallel comput-ers with multi-core compute nodes. We summa-rize three different Gröbner bases implementations:shared memory parallel, pure distributed memoryparallel and distributed memory combined withshared memory parallelism. The last algorithm,called distributed hybrid, uses only one c...
متن کاملA modified parallel F4 algorithm for shared and distributed memory architectures
In applications of symbolic computation an often required but complex procedure is finding Gröbner bases for polynomial ideals. Hence it is obvious to realize parallel algorithms to compute them. There are already flavours of the F4 algorithm like [4] and [13] using the special structure of the occurring matrices to speed up the reductions on parallel architectures with shared memory. In this p...
متن کاملParallel Reduction of Matrices in Gröbner Bases Computations
Unfortunately the computation is time-and memory intensive. Mathematical knowledge is used to optimize the algorithms. Computer science provides another possibility to increase the computations: parallelization 2 / 24 Motivation Gröbner bases are used, to solve polynomial equation systems, move robotics, verify programs,. .. Unfortunately the computation is time-and memory intensive. Mathematic...
متن کاملParallel Buchberger Algorithms on Virtual Shared Memory KSR1
We develop parallel versions of Buchbergers Gröbner Basis algorithm for a virtual shared memory KSR1 computer. A coarse grain version does S-polynomial reduction concurrently and respects the same critical pair selection strategy as the sequential algorithm. A fine grain version parallelizes polynomial reduction in a pipeline and can be combined with the parallel S-polynomial reduction. The alg...
متن کاملOn Computing Gröbner Bases in Rings of Differential Operators with Coefficients in a Ring
Following the definition of Gröbner bases in rings of differential operators given by Insa and Pauer(1998), we discuss some computational properties of Gröbner bases arising when the coefficient set is a ring. First we give examples to show that the generalization of S-polynomials is necessary for computation of Gröbner bases. Then we prove that under certain conditions the G-S-polynomials can ...
متن کامل